Aggregation of constraints across profiles

ABSTRACT

Leveraging profiles to define stereotypes for other profiles introduces efficiency into modeling. Although constraints can be inherited, constraints cannot currently be aggregated across profiles. Aggregating constraints across profiles leverages the labor invested in defining other profiles as well as adding flexibility to defining stereotypes.

RELATED APPLICATIONS

This application claims the priority benefit of U.S. application Ser. No. 11/929,065 filed Oct. 30, 2007.

BACKGROUND

Embodiments of the inventive subject matter generally relate to the field of modeling, and, more particularly, to aggregation of constraints across profiles.

The Unified Modeling Language (UML®) modeling language is the industry-standard language for specifying, visualizing, constructing, and documenting the artifacts of software systems. UML can be used to model deployment of an application, upgrade, configuration, etc., in an environment.

One of the standard UML diagrams is a deployment diagram, which graphically depicts a deployment model. The deployment diagram shows deployment to components of the environment (e.g., servers, clients, connections, virtual machines, etc.). A deployment diagram can visually depict where the different components of the system will physically run and how they will communicate with each other.

SUMMARY

A method comprises reading a stereotype of a first profile from a computer readable storage medium. The stereotype defines constraints to be applied to a model associated with the first profile. It is determined that the stereotype indicates a second profile and a third profile. The second profile and the third profile are accessed. A plurality of constraints are aggregated from across the second and the third profiles for use as constraints for the stereotype of the first profile. The profiles and the stereotype comport with semantics of a modeling language.

BRIEF DESCRIPTION OF THE DRAWINGS

The present embodiments may be better understood, and numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings.

FIG. 1 conceptually depicts an example tool that automates generation of executable code from a deployment model.

FIGS. 2-5 depict a flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model.

FIG. 2 depicts a first portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model.

FIG. 3 depicts a second portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model.

FIG. 4 depicts a third portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model.

FIG. 5 depicts a fourth portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model.

FIGS. 6-8 depict flowcharts of examples operations for generating executable code from a semantically correct deployment activity model.

FIGS. 6-7 depict a flowchart of example operations for generating a linear representation of a semantically correct deployment activity model.

FIG. 6 depicts a first portion of the flowchart of example operations for generating a linear representation of a semantically correct deployment activity model.

FIG. 7 depicts a second portion of the flowchart of example operations for generating an intermediate representation of a semantically correct deployment activity model.

FIG. 8 depicts a flowchart of example operations for generating executable code to orchestrate performance of the activities of the deployment activity model.

FIG. 9 depicts a conceptual example of transforming metadata in a database into a profile.

FIG. 10 depicts an example conceptual diagram of stereotype aggregation across profiles.

FIG. 11 depicts a flowchart of example operations for aggregating constraints across profiles to define a stereotype.

FIG. 12 depicts an example computer system.

DESCRIPTION OF EMBODIMENT(S)

The description that follows includes exemplary systems, methods, techniques, instruction sequences and computer program products that embody techniques of the present inventive subject matter. However, it is understood that the described embodiments may be practiced without these specific details. In other instances, well-known instruction instances, protocols, structures and techniques have not been shown in detail in order not to obfuscate the description.

Although a modeling language can be used to create a deployment diagram to graphically depict a deployment model, the utility of the deployment diagram is limited to easing understanding of the model. Automated generation of executable deployment code that implements a deployment model allows benefits of modeling to be realized. Automated generation of executable deployment code from a deployment model provides efficiency in time and resource utilization.

FIG. 1 conceptually depicts an example tool that automates generation of executable code from a deployment model. A computer 107 hosts a deployment tool 109. The deployment tool 109 allows a deployment topology model 101 to be created. The deployment tool 109 ensures that the deployment topology model 101 is semantically correct. For example, as a user creates the deployment topology model 101 the deployment model tool 109 generates warnings that attributes have not been defined, that relationships violate constraints, that values are not allowed, etc.

The deployment tool 109 automatically generates a deployment activity model 103 from the deployment topology model 101. With the deployment model tool 109, a user can define values and/or modify the deployment activity model 103. The deployment model tool 109 can also automatically define attributes (e.g., use default values, read values from a file, etc.). As with the deployment topology model 101, the deployment model tool 109 ensures that the deployment activity model 103 is semantically correct (“validates the model”).

After validating the deployment activity model 103, the deployment model tool 109 generates executable code 105 that orchestrates performance of activities indicated the deployment activity model 103. The deployment model tool 109 walks the deployment activity model 103 and looks up executable code units associated with the activities indicated in the deployment activity model 103. The deployment model tool 109 creates calls to these code units for the activities traversed in the deployment activity model 103 to generate the executable activity orchestration code 105. With the automatically generated executable orchestration code 105, deployment can be carried out over an enterprise system. The executable orchestration code 105 can deploy an application, configuration, add-on, update, etc.

The generation of executable orchestration code to carry out a deployment over a system was depicted in FIG. 1 as involving generation of a deployment activity model from a semantically correct deployment topology model and generation of the executable orchestration code from the deployment activity model, which was also semantically correct. These operations to generate the executable orchestration code may be visible or “under the covers.” For instance, a user may only see generation of the executable orchestration code after creating a semantically correct deployment topology model. Regardless of visibility, the deployment model tool traverses a representation (e.g., one or more data structures) of the one or more diagrams of the deployment topology model. The deployment model tool begins creating deployment activity models until a valid deployment activity model is created. Although the intermediate deployment activity models (assuming the first traversal attempt of the deployment topology model is unsuccessful) are discarded in some embodiments, other embodiments store the representations of the intermediate failed deployment activity models for analysis (e.g., analysis for the tool to learn, analysis to discover values for automatically defining attributes, etc.).

FIGS. 2-5 depict a flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model. FIG. 2 depicts a first portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model. At block 201, a deployment activity model is created with an initial node, final node, and one or more default activities. For instance, the deployment topology model may model deployment of an application X. A set of default activities are defined for application X, so that all deployment models for application X include these default activities. At block 203, a source node and a destination node are determined in the deployment topology model. Deployment may be from one or multiples machines or sources represented by source nodes. In addition, there may be multiple targets of a deployment. For example, files for deployment of application X may be sourced from three servers, and may be installed on a plurality of clients distributed over a global network. At block 205, attributes of the source node and destination node are determined. At block 207, a non-global constraint(s) of the source and destination nodes is determined.

At block 209, a loop of operations begins for each constraint. Control flows from block 209 to block 211. At block 211, one or more action for the constraint are performed. At block 213, it is determined if the constraint is satisfied. If the constraint is not satisfied, then control flows to block 215. If the constraint is satisfied, then control flows to block 221.

At block 215, it is determined if an action has been defined for failure of the constraint. If an action is defined for failure, then control flows to block 217. If an action has not been defined, then control flows to block 219.

At block 217, the action(s) defined for the failure is performed. Control flows from block 217 back to block 211 to attempt satisfying the constraint again.

At block 219, a notification is generated that the current deployment activity model does not satisfy the constraint. The notification informs a user as to the constraint that has failed to allow the user to remedy the failure. For instance, a prompt is displayed for a user to define an attribute that is needed to satisfy a constraint.

At block 221, the deployment activity model is modified in accordance with the one or more performed actions (e.g., an activity is added to the deployment activity model, a relationship is added, etc.). Control flows from block 221 to block 223. The loop of operations terminates at block 223. If each constraint has been evaluated, then control flows to block 301 of FIG. 3. If there are additional constraints, then control flows back to block 209.

FIG. 3 depicts a second portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model. At block 301, a path in the deployment topology model is determined from the source node to an unmarked destination node. At block 303, a connection in the path from the source node is selected. The source node and activity nodes may have multiple connections. At block 305, one or more constraints are determined for the selected connection. Of course, constraints may also have been determined for the source node. At block 307, a loop of operations begins for each constraint. Control flows from block 307 to block 309.

At block 309, one or more actions for the connection constraint are performed. At block 311, it is determined if the constraint is satisfied. If the constraint is not satisfied, then control flows to block 315. If the constraint is satisfied, then control flows to block 313.

At block 315, it is determined if an action has been defined for failure of the connection constraint. If an action is defined for failure, then control flows to block 317. If an action has not been defined, then control flows to block 319.

At block 317, the action(s) defined for the failure is performed. Control flows from block 317 back to block 309 to attempt satisfying the connection constraint again.

At block 319, a notification is generated that the current deployment activity model does not satisfy the constraint.

At block 313, the deployment activity model is modified in accordance with the one or more performed actions of the constraint. Control flows from block 313 to block 320, which terminates the loop if all constraints have been evaluated. Otherwise, control flows back to block 307.

After all constraints have been evaluated, control flows to block 321. At block 321, it is determined if the selected connection connects to the unmarked destination node. If the connection connects to the destination node, then control flows to block 325. If the connection does not connect to the destination node, then control flows to block 323.

At block 325, the destination node is marked. At block 327, it is determined if all destination nodes in the deployment topology model have been reached. If all destination nodes have not been reached, then control flows to block 301. If all destination nodes have been reached, then control flows to block 501 of FIG. 1.

If the connection did not connect to the destination node, then a constraint(s) of the next node in the path is determined at block 323. Control flows from block 323 to block 401 of FIG. 4.

FIG. 4 depicts a third portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model. At block 401, a loop of operations begins for each determined constraint of the next node. At block 403, one or more actions of the constraint are performed. At block 405, it is determined if the constraint is satisfied. If the constraint is satisfied, then control flows to block 407. If the constraint is not satisfied, then control flows to block 411.

At block 411, it is determined if an action has been defined for failure of the node constraint. If an action is defined for failure, then control flows to block 413. If an action has not been defined, then control flows to block 415.

At block 413, the action(s) defined for the failure is performed. Control flows from block 413 back to block 403 to attempt satisfying the node constraint again.

At block 415, a notification is generated that the current deployment activity model does not satisfy the node constraint.

At block 407, the deployment activity model is modified in accordance with the one or more performed actions of the node constraint. Control flows from block 407 to block 409, which terminates the loop if all constraints of the node have been evaluated. Otherwise, control flows back to block 401.

If all constraints of the node have been evaluated, then the next connection is selected at block 417. Control flows from block 417 back to block 307 of FIG. 3.

FIG. 5 depicts a fourth portion of the flowchart of example operations to automatically generate a deployment activity model from a semantically correct deployment topology model. At block 501, it is determined if there are any global constraints. If there are no global constraints, then control flows to block 503. If there are global constraints of the deployment topology model, then control flows to block 505.

At block 505, a loop of operations begins for each global constraint. At block 507, one or more actions of the global constraint are performed. At block 508, it is determined if the global constraint is satisfied. If the global constraint is satisfied, then control flows to block 515. If the global constraint is not satisfied, then control flows to block 509.

At block 509, it is determined if an action has been defined for failure of the global constraint. If an action is defined for failure, then control flows to block 511. If an action has not been defined, then control flows to block 513.

At block 511, the action(s) defined for the failure is performed. Control flows from block 511 back to block 507 to attempt satisfying the global constraint again.

At block 513, a notification is generated that the current deployment activity model does not satisfy the global constraint.

At block 515, the deployment activity model is modified in accordance with the one or more performed actions of the global constraint. Control flows from block 515 to block 517, which terminates the loop if all of the global constraints have been evaluated. Otherwise, control flows back to block 505.

If all of the global constraints have been evaluated and satisfied, then control flows from block 517 to block 503.

At block 503, the deployment activity model is stored.

With a semantically correct deployment activity model, executable code can be created to implement the modeled deployment. The semantically correct deployment activity model can be processed to generate one or more executable files with executable code units that correspond to the activities of the deployment activity model.

FIGS. 6-8 depict flowcharts of examples operations for generating executable code from a semantically correct deployment activity model. FIGS. 6-7 depict a flowchart of example operations for generating a linear representation of a semantically correct deployment activity model. FIG. 6 depicts a first portion of the flowchart of example operations for generating a linear representation of a semantically correct deployment activity model. At block 601, an activity queue is created with an entry for the initial node of a semantically correct deployment activity model. It should be understood that this example utilizes a queue to aid in understanding the inventive subject matter. A variety of structures, however, can be used as a linear representation of the deployment activity model. Regardless the particular realization, the linear representation expresses the deployment activity model in an essentially linear manner. At block 603, a constraint(s) of an edge from the initial node is evaluated. At block 605, it is determined if the constraint(s) is satisfied. If the constraint(s) is satisfied, then control flows to block 611. If the constraint(s) is not satisfied, then control flows to block 607.

At block 607, a notification is generated that the edge constraint is not satisfied. For instance, a prompt is generated requesting input of a value to define an attribute. A dashed line from block 607 to block 609 indicates flow of control after some input. For example, input is read from a file or input by a user. At block 609, an attribute is defined for the edge. Control flows from block 609 to block 603.

At block 611, the edge is marked and traversed. At block 613, it is determined if the edge terminates at the final node or an activity. If the edge terminates at the final node, then control flows to block 627. If the edge terminates at an activity that is not the final node, then control flows to block 615.

At block 615, the one or more constraints of the activity are evaluated. At block 617, it is determined if the evaluated constraint(s) is satisfied. If the constraint(s) is not satisfied, then control flows to block 619. If the constraint is satisfied, then control flows to block 623.

At block 619, a notification is generated that the constraint(s) was not satisfied. After receiving input to resolve the failure, control flows to block 622. At block 622, an attribute is defined for the activity. Control flows from block 622 back to block 615.

At block 623, the activity is queued in an activity queue. At block 625, the activity is marked. Control flows from block 625 to block 701 of FIG. 7.

If it was determined at block 613 that the traversed edge terminated at the final node, then it is determined if there are any unmarked activities at block 627. If there are unmarked activities of the deployment activity model, then control flows to block 629. If there are not unmarked activities of the deployment activity model, then control flows to block 631.

At block 629, an error notification is generated. The error notification may identify those of the activities that were not visited during processing of the deployment activity model.

At block 631, a final activity, if any, that corresponds to the final node is queued. At block 633, one or more executable orchestration files are generated with the activity queue.

FIG. 7 depicts a second portion of the flowchart of example operations for generating an intermediate representation of a semantically correct deployment activity model. At block 701, it is determined if there are multiple unmarked edges from the activity. If there are multiple unmarked edges from the activity, then control flows to block 703. If there is only one unmarked edge from the activity, then control flows to block 705.

At block 703, the activity is pushed onto a traversal stack. Control flows from block 703 to block 705.

At block 705, a constraint(s) of the unmarked edge is evaluated. At block 707, it is determined if the constraint(s) of the edge is satisfied. If the constraint(s) of the edge is satisfied, then control flows to block 611 of FIG. 6. If the edge of the constraint(s) is not satisfied, then control flows to block 709.

At block 709, it is determined if the traversal stack is empty. If the traversal stack is empty, then control flows to block 607 of FIG. 6. If the traversal stack is not empty, then control flows to block 711.

At block 711, an activity is popped from the traversal stack. Control flows from block 711 back to block 701. When an activity has multiple edges outgoing from the activity, the edges may require traversal in a particular order after certain conditions have been satisfied and/or after attributes have been defined.

FIG. 8 depicts a flowchart of example operations for generating executable code to orchestrate performance of the activities of the deployment activity model. At block 801, an initial activity is dequeued from the activity queue. At block 803, an executable activity orchestration file is created with a call to a code unit associated with the initial activity. For example, a deployment model tool searches a database for the activity or an entry for the activity, which indicates the code unit (e.g., function, library file, procedure, subroutine, script, etc.). The call to the code unit is created with attribute values for parameters. At block 805, the next activity is dequeued from the activity queue. At block 807, the code unit associated with the dequeued activity is determined. At block 809, a call to the determined code unit is created with attribute values of the activity as parameters. At block 811, it is determined if the activity queue is empty. If the activity queue is not empty, then control flows back to block 805. If the activity queue is empty, then control flows to block 813.

At block 813, the executable orchestration file is stored.

It should be understood that the above flowcharts are for understanding the inventive subject matter, and not for limiting embodiments of the inventive subject matter. Additional operations may be performed to process nested elements (e.g., nested activities or nested nodes). A deployment model may be graphically depicted with multiple deployment diagrams, including nested diagrams. For instance, an activity may represent another activity diagram. In addition, a deployment activity model may include decision nodes. Additional operations would be performed to traverse the model with decision nodes and create or look-up code to implement the decision nodes.

To create a deployment model, or any other model, profiles are used. Typically, profiles are created manually with stereotypes. The stereotypes define tagged values and constraints to be applied to a model associated with the profile. The resources expended creating these profiles can be recovered by creating a database with metadata to be used for automated profile generation. With the structure of the metadata as stored in a database, metadata in the database can be read and transformed into one or more profiles. Automated profile generated created profiles efficiently and allows for flexible creation of profiles. For instance, the same database can be used for different profiles by manipulating the transformation.

FIG. 9 depicts a conceptual example of transforming metadata in a database into a profile. A database 905 includes metadata. In a stage A, a profile generation unit 903 reads a profile mapping scheme 901. The profile mapping scheme maps the structure of the database to profile structure. Although only one mapping structure is depicted, the profile generation unit 903 can read multiple profiles to generate multiple profiles or to create a single profile from multiple mapping schemes, multiple databases, etc.

The profile generation unit 903 is depicted as a sole unit in FIG. 9. The profile generation unit may interface with a deployment model tool, be a component of the deployment model tool, etc.

In a stage B, the profile generation unit reads metadata from the database 905 in accordance with the profile mapping scheme 901. The one or more entries read by the profile generation unit 901 may be selected automatically (e.g., as defined in the profile mapping scheme, in accordance with a file, etc.) or manually (e.g., in accordance with parameters entered by a user).

In a stage C, the profile generation unit 903 creates a profile 907 with metadata. The profile 907 is created in accordance with the profile mapping scheme 901. For example, the database 905 is hierarchically structured so that each root entry corresponds to a profile. The next level corresponds to stereotypes. Although the mapping scheme may be highly detailed, the mapping scheme may also disregard details that are can be discerned by the tool or application that reads a resulting profile. For instance, the database may be structured to have different levels for constraints and tagged values. On the other hand, the database may be structured so that constraints and tagged values occupy the same level. The profile generation unit 903 does not need to be aware of which metadata correspond to constraints and which correspond to tagged values.

In addition to automated generation of profiles, leveraging profiles to define stereotypes for other profiles introduces efficiency into modeling. Although constraints can be inherited, constraints cannot be aggregated across profiles. Aggregating constraints across profiles leverages the labor invested in defining other profiles as well as adding flexibility to defining stereotypes.

FIG. 10 depicts an example conceptual diagram of stereotype aggregation across profiles. A profile A 1001 is comprised of a stereotype A and a stereotype B. Stereotype A is defined with a constraint(s) A and tagged values. Stereotype B is defined with a constraint(s) B. A profile B 1003 is comprised stereotype C and a stereotype D. Stereotype C is defined with a constraint(s) C and tagged value(s). The stereotype D is defined with a constraint(s) D. A profile C 1005 is defined with a stereotype E. Stereotype E is annotated with a special tag that identifies profiles A and B 1001, 1003. Other techniques besides tagging can be used to associated a stereotype with profiles. The stereotype definition can reference the profiles with pointers, have identifiers for the profiles, etc. The stereotype E is defined with all of the constraints of the profiles A and B 1001, 1003. In other words, stereotype E is defined with the aggregation of the constraints A, B, C, D.

FIG. 11 depicts a flowchart of example operations for aggregating constraints across profiles to define a stereotype. At block 1101, an association of one or more profiles is detected for a stereotype. For example, when a model is loaded into a system, a tool or engine processes the model and encounters profiles with stereotypes indicating profiles for constraint aggregation. At block 1103, an associated profile is accessed. At block 1105, one or more stereotypes of the associated profile are copied as stereotype(s) of the subject profile. Of course, there may be zero stereotypes and one or more stereotypes associated with other profiles. Nested profile associations or nested constraint aggregation can be processed recursively, although not depicted in FIG. 11 in order not to obfuscate the inventive subject matter. At block 1109, it is determined if there are additional profiles associated with the subject profile. If there are additional associated profiles, then control flows to block 1113. If there are no further associated profiles, then control flows to block 1115.

At block 1113, the next profile associated with the subject profile is accessed. Control flows from block 1113 back to block 1105.

At block 1115, the subject profile is committed. Committing indicates that the profile is available for use. Committing may involve writing to a particular memory location, setting a flag, etc.

The example operations of FIG. 11 build an in-memory representation of a profile with a stereotype defined with aggregated constraints. Although FIG. 11 assumes a pass by value type of in-memory stereotype, the stereotype may be defined in memory with a reference to the profiles. Each time the stereotype is processed, the one or more references to profiles are followed to read the constraints of the associated profiles. An associated profile may include a stereotype that is associated with another profile, thus having nested constraint aggregation.

It should be realized that the above flowcharts are of example operations. The depicted operations may be performed in a different order, in parallel, etc. In addition, certain operations may not be performed, and additional operations may be performed.

As will be appreciated by one skilled in the art, aspects of the present inventive subject matter may be embodied as a system, method or computer program product. Accordingly, aspects of the present inventive subject matter may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present inventive subject matter may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. A computer readable storage medium does not include transitory, propagating signals.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present inventive subject matter may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present inventive subject matter are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the inventive subject matter. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

FIG. 12 depicts an example computer system. A computer system includes a processor unit 1201 (possibly including multiple processors, multiple cores, multiple nodes, and/or implementing multi-threading, etc.). The computer system includes memory 1207. The memory 1207 may be system memory (e.g., one or more of cache, SRAM, DRAM, zero capacitor RAM, Twin Transistor RAM, eDRAM, EDO RAM, DDR RAM, EEPROM, NRAM, RRAM, SONOS, PRAM, etc.) or any one or more of the above already described possible realizations of machine-readable media. The computer system also includes a bus 1203 (e.g., PCI, ISA, PCI-Express, HyperTransport® bus, InfiniBand® bus, NuBus bus, etc.), a network interface 1209 (e.g., an ATM interface, an Ethernet interface, a Frame Relay interface, SONET interface, wireless interface, etc.), and a storage device(s) 1211 (e.g., optical storage, magnetic storage, etc.). The computer system also includes a deployment modeling tool unit 1221. The deployment modeling tool unit 1221 embodies functionality to implement embodiments described above. The deployment modeling tool unit 1221 may be partially or wholly embodied as instructions encoded in the system memory 1207 and/or the storage device 1211. The deployment modeling tool unit 1221 may also be implemented as logic in the processor unit 1201 and/or a co-processor unit, an application specific integrated circuit, etc. Further, realizations may include fewer or additional components not illustrated in FIG. 12 (e.g., video cards, audio cards, additional network interfaces, peripheral devices, etc.). The processor unit 1201, the storage device(s) 1211, the deployment modeling tool unit 1221, and the network interface 1209 are coupled to the bus 1203. Although illustrated as being coupled to the bus 1203, the memory 1207 may be coupled to the processor unit 1201.

While the embodiments are described with reference to various implementations and exploitations, it will be understood that these embodiments are illustrative and that the scope of the invention(s) is not limited to them. In general, embodiments as described herein may be implemented with facilities consistent with any hardware system or hardware systems. Many variations, modifications, additions, and improvements are possible.

Plural instances may be provided for components, operations or structures described herein as a single instance. Finally, boundaries between various components, operations and data stores are somewhat arbitrary, and particular operations are illustrated in the context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within the scope of the invention(s). In general, structures and functionality presented as separate components in the exemplary configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements may fall within the scope of the invention(s). 

What is claimed is:
 1. A method comprising: reading a stereotype of a first profile from a computer readable storage medium, wherein the stereotype defines constraints to be applied to a model associated with the first profile; determining that the stereotype indicates a second profile and a third profile; accessing the second profile and the third profile; and aggregating a plurality of constraints from across the second profile and the third profile for use as constraints for the stereotype of the first profile, wherein the profiles and the stereotype comport with semantics of a modeling language.
 2. The method of claim 1, wherein said aggregating comprises: copying the plurality of constraints into a definition of the stereotype of the first profile.
 3. The method of claim 1, wherein said aggregating comprises writing references to the plurality of constraints into a definition of the stereotype of the first profile.
 4. The method of claim 3 further comprising writing references to the second profile and the third profile into the definition of the stereotype of the first profile.
 5. The method of claim 1 further comprising aggregating attributes from across the second profile and the third profile for use as attributes for the stereotype of the first profile.
 6. The method of claim 1, wherein the modeling language comprises the unified modeling language.
 7. The method of claim 1, wherein the profiles tailor the modeling language to one or more domains.
 8. A computer program product for aggregating constraints across profiles, the computer program product comprising: a computer readable storage medium having computer usable program code embodied therewith, the computer usable program code comprising a computer usable program code configured to, read a stereotype of a first profile, wherein the stereotype defines constraints to be applied to a model associated with the first profile; determine that the stereotype indicates a second profile and a third profile; access the second profile and the third profile; and aggregate a plurality of constraints from across the second profile and the third profile for use as constraints for the stereotype of the first profile, wherein the profiles and the stereotype comport with semantics of a modeling language.
 9. The computer program product of claim 8, wherein said aggregating operation comprises copying the plurality of constraints into a definition of the stereotype of the first profile.
 10. The computer program product of claim 8, wherein said aggregating operation comprises writing references to the plurality of constraints into a definition of the stereotype of the first profile.
 11. The computer program product of claim 8, wherein the operations further comprise writing references to the second profile and the third profile into the definition of the stereotype of the first profile.
 12. The computer program product of claim 8, wherein the operations further comprise aggregating attributes from across the second profile and the third profile for use as attributes for the stereotype of the first profile.
 13. The computer program product of claim 8, wherein the modeling language comprises the unified modeling language.
 14. The computer program product of claim 8, wherein the profiles tailor the modeling language to one or more domains.
 15. An apparatus comprising: a set of one or more processing units; and a deployment modeling language tool unit operable to, read a stereotype of a first profile, wherein the stereotype defines constraints to be applied to a model associated with the first profile; determine that the stereotype indicates a second profile and a third profile; access the second profile and the third profile; and aggregate a plurality of constraints from across the second profile and the third profile for use as constraints for the stereotype of the first profile, wherein the profiles and the stereotype comport with semantics of a modeling language.
 16. The apparatus of claim 15, wherein the deployment modeling language tool unit being operable to aggregate comprises the deployment modeling language tool being operable to copy the plurality of constraints into a definition of the stereotype of the first profile.
 17. The apparatus of claim 15, wherein the deployment modeling language tool unit being operable to aggregate comprises the deployment modeling language tool unit being operable to write references to the plurality of constraints into a definition of the stereotype of the first profile.
 18. The apparatus of claim 15, wherein the deployment modeling language tool unit is further operable to write references to the second profile and the third profile into the definition of the stereotype of the first profile.
 19. The apparatus of claim 15, wherein the deployment modeling language tool unit is further operable to aggregate attributes from across the second profile and the third profile for use as attributes for the stereotype of the first profile.
 20. The apparatus of claim 15, wherein the modeling language comprises the unified modeling language. 